On the State Complexity of the Reverse of - and -Trivial Regular Languages
نویسندگان
چکیده
The tight upper bound on the state complexity of the reverse of R-trivial and J -trivial regular languages of the state complexity n is 2n−1. The witness is ternary for R-trivial regular languages and (n− 1)ary for J -trivial regular languages. In this paper, we prove that the bound can be met neither by a binary R-trivial regular language nor by a J -trivial regular language over an (n − 2)-element alphabet. We provide a characterization of tight bounds for R-trivial regular languages depending on the state complexity of the language and the size of its alphabet. We show the tight bound for J -trivial regular languages over an (n− 2)-element alphabet and a few tight bounds for binary J -trivial regular languages. The case of J -trivial regular languages over an (n−k)element alphabet, for 2 ≤ k ≤ n− 3, is open.
منابع مشابه
On the State Complexity of the Reverse of R- and J -trivial Regular Languages
The tight upper bound on the state complexity of the reverse of R-trivial and J -trivial regular languages of the state complexity n is 2n−1. The witness is ternary for R-trivial regular languages and (n− 1)ary for J -trivial regular languages. In this paper, we prove that the bound can be met neither by a binary R-trivial regular language nor by a J -trivial regular language over an (n − 2)-el...
متن کاملSyntactic Complexity of R- and J-Trivial Regular Languages
The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular languages is the maximal syntactic complexity of languages in that class, taken as a function of the state complexity n of these languages. We study the syntactic complexity of Rand J -trivial regular languages, and prove that n! and ⌊e(n −...
متن کاملAlternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کاملState Complexity of Basic Operations on Non-returning Regular Languages
We consider the state complexity of basic operations on non-returning regular languages. For a non-returning minimal DFA, the start state does not have any in-transitions. We establish the precise state complexity of four Boolean operations (union, intersection, difference, symmetric difference), catenation, reverse, and Kleene-star for non-returning regular languages. Our results are usually s...
متن کاملDeterministic Fuzzy Automaton on Subclasses of Fuzzy Regular ω-Languages
In formal language theory, we are mainly interested in the natural language computational aspects of ω-languages. Therefore in this respect it is convenient to consider fuzzy ω-languages. In this paper, we introduce two subclasses of fuzzy regular ω-languages called fuzzy n-local ω-languages and Buchi fuzzy n-local ω-languages, and give some closure properties for those subclasses. We define a ...
متن کامل